Computing Kazhdan Constants by Semidefinite Programming
نویسندگان
چکیده
منابع مشابه
Kazhdan Constants of Group Extensions
We give bounds on Kazhdan constants of abelian extensions of (finite) groups. As a corollary, we improved known results of Kazhdan constants for some meta-abelian groups and for the relatively free group in the variety of p-groups of lower p-series of class 2. Furthermore, we calculate Kazhdan constants of the tame automorphism groups of the free nilpotent groups.
متن کاملKazhdan Constants for Sln(Z)
In this article we improve the known Kazhdan constant for SLn(Z) with respect to the generating set of the elementary matrices. We prove that the Kazhdan constant is bounded from below by [42 √ n + 860], which gives the exact asymptotic behavior of the Kazhdan constant, as n goes to infinity, since √ 2/n is an upper bound. We can use this bound to improve the bounds for the spectral gap of the ...
متن کاملKazhdan Constants of Hyperbolic Groups ∗
Let H be an infinite hyperbolic group with Kazhdan property (T ) and let κ(H,X) denote the Kazhdan constant of H with respect to a generating set X . We prove that infX κ(H,X)= 0, where the infimum is taken over all finite generating sets of H . In particular, this gives an answer to a Lubotzky question.
متن کاملSparse Approximation by Semidefinite Programming
The problem of sparse approximation and the closely related compressed sensing have received tremendous attention in the past decade. Primarily studied from the viewpoint of applied harmonic analysis and signal processing, there have been two dominant algorithmic approaches to this problem: Greedy methods called the matching pursuit (MP) and the linear programming based approaches called the ba...
متن کاملSemidefinite Programming
3 Why Use SDP? 5 3.1 Tractable Relaxations of Max-Cut . . . . . . . . . . . . . . . . . . . . . . . . 5 3.1.1 Simple Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.2 Trust Region Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.3 Box Constraint Relaxation . . . . . . . . . . . . . . . . . . . . . . . . 6 3.1.4 Eigenvalue Bound . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Experimental Mathematics
سال: 2017
ISSN: 1058-6458,1944-950X
DOI: 10.1080/10586458.2017.1396509